#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)
#define FOR(i,a,b) for (int i = a; i <= b; i ++)
#define DOW(i,a,b) for (int i = b; i >= a; -- i)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 11;

bool g[N][N];
int n;
int res;

bool check(int row, int col) {
    for (int i = 0; i < row; i ++ ) 
        for (int j = 0; j < n; j ++ ) 
            if (g[i][j] && (i == col || (abs(row - i) == abs(col - j) && (row - i < 3))))
                return false;
    return true;
}

void dfs(int row) {
    if (row == n) {
        res ++; return;
    }
    for (int col = 0; col < n; col ++ ) {
        if (check(row, col)) {
            g[row][col] = true;
            dfs(row + 1);
            g[row][col] = false;
        }
    }
}

inline void solution2() {
    while(cin >> n){
        res = 0;
        dfs(0);
        cout << res << endl;
    }
    
}

int a[11] = {0, 1, 1, 1, 2, 6, 19, 78, 383, 2213, 14734};

inline void solution() {
    cin >> n;
    cout << a[n] << endl;
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}